Bioluminescent Swarm Optimization Algorithm

نویسندگان

  • Daniel Rossato de Oliveira
  • Rafael S. Parpinelli
  • Heitor S. Lopes
چکیده

Evolutionary Computation (EC) is a research area of metaheuristics mainly applied to real-world optimization problems. EC is inspired by biological mechanisms such as reproduction, mutation, recombination, natural selection and collective animal behavior. Two branches of EC can be highlighted: Evolutionary Algorithms (EA) comprising Genetic Algorithms (Goldberg, 1989), Genetic Programming (Koza, 1992), Differential Evolution (Storn & Price, 1997), Harmony Search (Geem et al., 2001), and others; and Swarm Intelligence (SI) comprising Ant Colony Optimization (ACO) (Dorigo & Stützle, 2004) and Particle Swarm Optimization (PSO) (Kennedy & Eberhart, 2001; Poli et al., 2007) and others. The ACO metaheuristic1 is inspired by the foraging behavior of ants. On the other hand, the PSO metaheuristic2 is motivated by the coordinated movement of fish schools and bird flocks. Both ACO and PSO approaches have been applied successfully in a vast range of problems (Clerc, 2006; Dorigo & Stützle, 2004). In recent years, new SI algorithms were proposed. They have in common biological inspirations, such as bacterial foraging (Passino, 2002), slime molds life cycle (Monismith & Mayfield, 2008), various bees behaviors (Karaboga & Akay, 2009), cockroaches infestation (Havens et al., 2008), mosquitoes host-seeking (Feng et al., 2009), bats echolocation (Yang, 2010), and fireflies bioluminescense (Krishnanand & Ghose, 2005; 2009; Yang, 2009). This work proposes a new swarm-based evolutionary approach based on the bioluminescent behavior of fireflies, called Bioluminescent Swarm Optimization (BSO) algorithm. The BSO uses two basic characteristics of the Glow-worm Swarm Optimization (GSO) algorithm proposed by (Krishnanand & Ghose, 2005): the luciferin attractant, and the stochastic neighbor selection. However, BSO goes further introducing new features such as: stochastic adaptive step sizing, global optimum attraction, leader movement, and mass extinction. Besides, the proposed algorithm is hybridized with two local search techniques: local unimodal sampling and single-dimension perturbation. All these features makes BSO a powerful algorithm for hard optimization problems. Experiments were done to analyze the sensitivity of the BSO to control parameters. Later, extensive experiments were performed using several benchmark functions with high

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Approach for Sensor Deployment in Wsn

Wireless Sensor Networks (WSNs) consists of arbitrarily placed tiny sensors which monitor the target field. Every location of the target field is said to be with at least one sensor. The sensors must be deployed in such a way that every sensor is efficiently used to monitor the target field with less coverage loss. Glow worm Swarm Optimization (GSO) technique is swarm intelligence based techniq...

متن کامل

Diversified Particle Swarm Optimization for Hybrid Flowshop Scheduling

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

متن کامل

Firefly Algorithm for Continuous Constrained Optimization Tasks

The paper provides an insight into the improved novel metaheuristics of the Firefly Algorithm for constrained continuous optimization tasks. The presented technique is inspired by social behavior of fireflies and the phenomenon of bioluminescent communication. The first part of the paper is devoted to the detailed description of the existing algorithm. Then some suggestions for extending the si...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

A New Shuffled Sub-swarm Particle Swarm Optimization Algorithm for Speech Enhancement

In this paper, we propose a novel algorithm to enhance the noisy speech in the framework of dual-channel speech enhancement. The new method is a hybrid optimization algorithm, which employs the  combination of  the  conventional θ-PSO and the shuffled sub-swarms particle optimization (SSPSO) technique. It is known that the θ-PSO algorithm has better optimization performance than standard PSO al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012